PathStack : A Holistic Path Join Algorithm for Path Query with Not-Predicates on XML Data
نویسندگان
چکیده
The evaluation of path queries forms the basis of complex XML query processing which has attracted a lot of research attention. However, none of these works have examined the processing of more complex queries that contain not-predicates. In this paper, we present the first study on evaluating path queries with not-predicates. We propose an efficient holistic path join algorithm, PathStack, which has the following advantages: (1) it requires only one scan of the relevant data to evaluate path queries with not-predicates; (2) it does not generate any intermediate results; and (3) its memory space requirement is bounded by the longest path in the input XML document. We also present an improved variant of PathStack that further minimizes unnecessary computations.
منابع مشابه
QuickStack: A Fast Algorithm for XML Query Matching
With the increasing popularity of XML for data representation and exchange, much research has been done for providing an efficient way to evaluate twig patterns in an XML database. As a result, many holistic join algorithms have been developed, most of which are derivatives of the well-known TwigStack algorithm. However, these algorithms still apply a two phase processing scheme: first identify...
متن کاملTwigStackList-: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data
As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called Twig...
متن کاملTJP: A Modified Twig Join Algorithm Based on the Pri-order Labeling Scheme
XML exploits a tree-structured data model for representing data, and XML queries specify patterns of selection predicates on multiple elements related by a tree structure. Finding all occurrences of such a twig pattern in an XML database is a core operation for XML query processing. A lot of algorithms have been proposed to process to XML twig pattern query based-on region labeling scheme, whic...
متن کاملTowards Cost-based Optimizations of Twig Content-based Queries
In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for this purpose. Some effort has been expended in the optimization of XML query processing [20]. There are not many works that take cost-based query optimizations into account. In work [20], we find some cost-based considerations,...
متن کاملCtree: A Compact Two-level Bidirectional Tree for Indexing XML Data
Indexing XML data to facilitate query processing has been a popular subject of study in recent years. Most of previous studies can be classified into three categories: path indexing, node indexing and sequence-based indexing. Many of them cannot answer both single-path and branching queries with various value predicates very efficiently. In this paper, we propose a novel compact tree (Ctree) st...
متن کامل